LP models for bin packing and cutting stock problems
نویسنده
چکیده
We review several linear programming (LP) formulations for the one-dimensional cutting stock and bin packing problems, namely, the models of Kantorovich, Gilmore–Gomory, onecut models, as in the Dyckhoff–Stadtler approach, position-indexed models, and a model derived from the vehicle routing literature. We analyse some relations between the corresponding LP relaxations, and their relative strengths, and refer how to derive branching schemes that can be used in the exact solution of these problems, using branch-and-price. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Bin packing and cutting stock problems: Mathematical models and exact algorithms
We review the most important mathematical models and algorithms developed for the exact solution of the one dimensional bin packing and cutting stock problems, and experimentally evaluate, on state-of-the art computers, the performance of the main available software tools.
متن کاملDual Inequalities for Stabilized Column Generation Revisited
Column generation (CG) models have several advantages over compact formulations, namely, they provide better LP bounds, may eliminate symmetry, and can hide non-linearities in their subproblems. However, users also encounter drawbacks in the form of slow convergency a.k.a. the tailing-off effect and the oscillation of the dual variables. Among different alternatives for stabilizing the CG proce...
متن کاملTwo-stage two-dimensional guillotine cutting stock problems with usable leftover
In this study we are concerned with the non-exact two-stage two-dimensional guillotine cutting problem considering usable leftovers, in which stock plates remainders of the cutting patterns (non-used material or trim loss) can be used in the future, if they are large enough to fulfill future demands of items (ordered smaller plates). This cutting problem can be characterized as a residual bin-p...
متن کاملTwo-stage two-dimensional guillotine cutting problems with usable leftovers∗
In this study we are concerned with the non-exact two-stage two-dimensional guillotine cutting problem considering usable leftovers, in which stock plates remainders of the cutting patterns (non-used material or trim loss) can be used in the future, if they are large enough to fulfill future demands of items (ordered smaller plates). This cutting problem can be characterized as a residual bin-p...
متن کاملGeneral Arc-flow Formulation with Graph Compression
We present an exact method, based on an arc-flow formulation with side constraints, for solving bin packing and cutting stock problems — including multi-constraint variants — by simply representing all the patterns in a very compact graph. Our method includes a graph compression algorithm that usually reduces the size of the underlying graph substantially without weakening the model. Our formul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 141 شماره
صفحات -
تاریخ انتشار 2002